home *** CD-ROM | disk | FTP | other *** search
- Path: orac.mon.rnb.com!usenet
- From: hdavies@kzin.mon.rnb.com (Hugh J.E. Davies)
- Newsgroups: comp.lang.misc,comp.lang.perl.misc,comp.lang.tcl,comp.lang.c,comp.lang.java
- Subject: Re: Relative Speed of Perl vs. Tcl vs. C
- Date: 24 Jan 1996 11:25:32 GMT
- Organization: Republic National Bank of New York
- Distribution: world
- Message-ID: <4e54vc$7sk@orac.mon.rnb.com>
- References: <4e3a2u$eoa@wcap.centerline.com>
- Reply-To: hdavies@kzin.mon.rnb.com
- NNTP-Posting-Host: kzin.mon.rnb.com
-
- In article <4e3a2u$eoa@wcap.centerline.com>, chase@centerline.com (David Chase) writes:
- >> Randal L. Schwartz (merlyn@stonehenge.com) wrote:
- >> : Tom Christiansen has had a long-standing bet that someone can't give
- >> : him a program in C that he can't make run no more than "e" times
- >> : slower (about 2.8 for you non-math-geeks) in Perl. So far, no one's
- >> : done it.
- >
- >Is this really true? What's the bet? Is a particular piece of hardware
- >specified? On modern RISC machines, carefully crafted C can multiply
- >large matrices at >50% of peak Mflops. To compete in Perl, I think
- >you'd have to run the "contest" on a particularly crufty piece of
- >hardware.
-
- Forgive my ignorance, and please correct me if I'm wrong, but if
- the 'C' is running faster because of faster hardware, wouldn't perl
- also? What would make a 'C' program run faster but not the 'perl'
- interpreter?
-
-
- --
- -----
- Hugh J.E. Davies, AVP Unix Support,
- Republic National Bank, 30 Monument Street, London.
- This is *NOT* an official publication of RNB.
- Personal email to huge@axalotl.demon.co.uk, please.
-
-
-
-